A hybrid control framework for an optimal visiting problem

The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close possible collection target points. does not verify dynamic programming principle, and it needs specific formulation keep track visited In this paper, we introduce hybrid approach by adding discontinuous part switching between group discrete states related targets. Then, show well-posedness Hamilton-Jacobi problem, reformulating time-dependent stopping problems.